TSTP Solution File: NUM699^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM699^1 : TPTP v8.1.2. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 08:14:34 EDT 2024
% Result : Theorem 0.21s 0.38s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of formulae : 31 ( 14 unt; 9 typ; 0 def)
% Number of atoms : 66 ( 20 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 97 ( 10 ~; 5 |; 0 &; 79 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 16 ( 0 ^ 16 !; 0 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
nat: $tType ).
thf(func_def_0,type,
nat: $tType ).
thf(func_def_1,type,
x: nat ).
thf(func_def_2,type,
y: nat ).
thf(func_def_3,type,
less: nat > nat > $o ).
thf(func_def_5,type,
lessis: nat > nat > $o ).
thf(func_def_6,type,
suc: nat > nat ).
thf(func_def_7,type,
pl: nat > nat > nat ).
thf(func_def_8,type,
n_1: nat ).
thf(f23,plain,
$false,
inference(subsumption_resolution,[],[f22,f17]) ).
thf(f17,plain,
( ( lessis @ ( suc @ y ) @ x )
!= $true ),
inference(cnf_transformation,[],[f13]) ).
thf(f13,plain,
( ( lessis @ ( suc @ y ) @ x )
!= $true ),
inference(flattening,[],[f12]) ).
thf(f12,plain,
( ( lessis @ ( suc @ y ) @ x )
!= $true ),
inference(fool_elimination,[],[f11]) ).
thf(f11,plain,
~ ( lessis @ ( suc @ y ) @ x ),
inference(rectify,[],[f5]) ).
thf(f5,negated_conjecture,
~ ( lessis @ ( suc @ y ) @ x ),
inference(negated_conjecture,[],[f4]) ).
thf(f4,conjecture,
lessis @ ( suc @ y ) @ x,
file('/export/starexec/sandbox2/tmp/tmp.mgT8WTMJtv/Vampire---4.8_21311',satz25c) ).
thf(f22,plain,
( ( lessis @ ( suc @ y ) @ x )
= $true ),
inference(trivial_inequality_removal,[],[f21]) ).
thf(f21,plain,
( ( $true != $true )
| ( ( lessis @ ( suc @ y ) @ x )
= $true ) ),
inference(superposition,[],[f20,f19]) ).
thf(f19,plain,
( ( less @ y @ x )
= $true ),
inference(cnf_transformation,[],[f10]) ).
thf(f10,plain,
( ( less @ y @ x )
= $true ),
inference(fool_elimination,[],[f9]) ).
thf(f9,plain,
less @ y @ x,
inference(rectify,[],[f1]) ).
thf(f1,axiom,
less @ y @ x,
file('/export/starexec/sandbox2/tmp/tmp.mgT8WTMJtv/Vampire---4.8_21311',l) ).
thf(f20,plain,
! [X0: nat,X1: nat] :
( ( ( less @ X0 @ X1 )
!= $true )
| ( ( lessis @ ( suc @ X0 ) @ X1 )
= $true ) ),
inference(backward_demodulation,[],[f16,f18]) ).
thf(f18,plain,
! [X0: nat] :
( ( pl @ X0 @ n_1 )
= ( suc @ X0 ) ),
inference(cnf_transformation,[],[f3]) ).
thf(f3,axiom,
! [X0: nat] :
( ( pl @ X0 @ n_1 )
= ( suc @ X0 ) ),
file('/export/starexec/sandbox2/tmp/tmp.mgT8WTMJtv/Vampire---4.8_21311',satz4a) ).
thf(f16,plain,
! [X0: nat,X1: nat] :
( ( ( less @ X0 @ X1 )
!= $true )
| ( ( lessis @ ( pl @ X0 @ n_1 ) @ X1 )
= $true ) ),
inference(cnf_transformation,[],[f15]) ).
thf(f15,plain,
! [X0: nat,X1: nat] :
( ( ( lessis @ ( pl @ X0 @ n_1 ) @ X1 )
= $true )
| ( ( less @ X0 @ X1 )
!= $true ) ),
inference(rectify,[],[f14]) ).
thf(f14,plain,
! [X1: nat,X0: nat] :
( ( ( lessis @ ( pl @ X1 @ n_1 ) @ X0 )
= $true )
| ( ( less @ X1 @ X0 )
!= $true ) ),
inference(ennf_transformation,[],[f8]) ).
thf(f8,plain,
! [X1: nat,X0: nat] :
( ( ( less @ X1 @ X0 )
= $true )
=> ( ( lessis @ ( pl @ X1 @ n_1 ) @ X0 )
= $true ) ),
inference(fool_elimination,[],[f7]) ).
thf(f7,plain,
! [X0: nat,X1: nat] :
( ( less @ X1 @ X0 )
=> ( lessis @ ( pl @ X1 @ n_1 ) @ X0 ) ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
! [X0: nat,X1: nat] :
( ( less @ X1 @ X0 )
=> ( lessis @ ( pl @ X1 @ n_1 ) @ X0 ) ),
file('/export/starexec/sandbox2/tmp/tmp.mgT8WTMJtv/Vampire---4.8_21311',satz25b) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM699^1 : TPTP v8.1.2. Released v3.7.0.
% 0.14/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.35 % Computer : n011.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 14:36:23 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a TH0_THM_EQU_NAR problem
% 0.15/0.36 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.mgT8WTMJtv/Vampire---4.8_21311
% 0.21/0.37 % (21424)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (3000ds/4Mi)
% 0.21/0.37 % (21425)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (3000ds/27Mi)
% 0.21/0.37 % (21423)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (3000ds/183Mi)
% 0.21/0.37 % (21426)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.21/0.37 % (21428)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (3000ds/275Mi)
% 0.21/0.37 % (21430)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (3000ds/3Mi)
% 0.21/0.37 % (21429)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (3000ds/18Mi)
% 0.21/0.37 % (21428)Refutation not found, incomplete strategy
% 0.21/0.37 % (21428)------------------------------
% 0.21/0.37 % (21428)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (21428)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.38
% 0.21/0.38
% 0.21/0.38 % (21428)Memory used [KB]: 5500
% 0.21/0.38 % (21428)Time elapsed: 0.003 s
% 0.21/0.38 % (21428)Instructions burned: 2 (million)
% 0.21/0.38 % (21428)------------------------------
% 0.21/0.38 % (21428)------------------------------
% 0.21/0.38 % (21424)Instruction limit reached!
% 0.21/0.38 % (21424)------------------------------
% 0.21/0.38 % (21424)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (21424)Termination reason: Unknown
% 0.21/0.38 % (21424)Termination phase: Saturation
% 0.21/0.38
% 0.21/0.38 % (21424)Memory used [KB]: 5500
% 0.21/0.38 % (21424)Time elapsed: 0.004 s
% 0.21/0.38 % (21424)Instructions burned: 4 (million)
% 0.21/0.38 % (21424)------------------------------
% 0.21/0.38 % (21424)------------------------------
% 0.21/0.38 % (21426)First to succeed.
% 0.21/0.38 % (21427)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.21/0.38 % (21425)Also succeeded, but the first one will report.
% 0.21/0.38 % (21427)Instruction limit reached!
% 0.21/0.38 % (21427)------------------------------
% 0.21/0.38 % (21427)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (21427)Termination reason: Unknown
% 0.21/0.38 % (21427)Termination phase: Saturation
% 0.21/0.38
% 0.21/0.38 % (21427)Memory used [KB]: 5373
% 0.21/0.38 % (21427)Time elapsed: 0.003 s
% 0.21/0.38 % (21427)Instructions burned: 2 (million)
% 0.21/0.38 % (21427)------------------------------
% 0.21/0.38 % (21427)------------------------------
% 0.21/0.38 % (21426)Refutation found. Thanks to Tanya!
% 0.21/0.38 % SZS status Theorem for Vampire---4
% 0.21/0.38 % SZS output start Proof for Vampire---4
% See solution above
% 0.21/0.38 % (21426)------------------------------
% 0.21/0.38 % (21426)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (21426)Termination reason: Refutation
% 0.21/0.38
% 0.21/0.38 % (21426)Memory used [KB]: 5500
% 0.21/0.38 % (21426)Time elapsed: 0.004 s
% 0.21/0.38 % (21426)Instructions burned: 1 (million)
% 0.21/0.38 % (21426)------------------------------
% 0.21/0.38 % (21426)------------------------------
% 0.21/0.38 % (21422)Success in time 0.008 s
% 0.21/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------